Large regular simplices contained in a hypercube
نویسندگان
چکیده
We prove that the n-dimensional unit hypercube contains an n-dimensional regular simplex of edge length c √ n, where c > 0 is a constant independent of n. Let l∆n be the n-dimensional regular simplex of edge length l, and let lQn be the n-dimensional hypercube of edge length l. For simplicity, we omit l if l= 1, e.g., Qn denotes the unit hypercube. We are interested in the maximum edge length of a regular n-dimensional simplex contained in Qn. Theorem. For every ε0 > 0 there is an N0 such that for every n > N0 one has ( 1− ε0 2 √ n ) ∆n ⊂ Qn. On the other hand, if l∆n ⊂ Qn, then l ≤ √ (n+1)/2, which follows by comparing the circumscribed balls of l∆n and Qn. (Recall that the circumradius of ∆n is √ n/(2n+2).) This upper bound is reached iff there exists an Hadamard matrix of order n+1. Schoenberg [3] pointed out that this “readily established fact” went back to Coxeter, see also §4 of [1]. Our lower bound given by the theorem is approximately 1/ √ 2 of the upper bound. Proof of Theorem. For a matrix (or a vector) A=(ai j), let us define its norm by ∥A∥ := maxi j |ai j|. Let Jn be the n×n all one matrix. Lemma 1. Let A = (ai j) be an n×n real orthogonal matrix, and let c > 0 be a constant. If ∥A∥ ≤ 1 c √ n (1) Date: November 18, 2008. 2000 Mathematics Subject Classification. Primary: 52C07 Secondary: 05B20.
منابع مشابه
Maximum volume simplices and trace-minimal graphs
Let (v, δ) be the set of all δ-regular graphs on v vertices. A graphG ∈ (v, δ) is trace-minimal in (v, δ) if the vector whose ith entry is the trace of the ith power of the adjacency matrix of G, is minimum under the lexicographic order among all such vectors corresponding to graphs in (v, δ). We consider the problem of maximizing the volume of an n-dimensional simplex consisting of n + 1 verti...
متن کاملRadii of Regular Polytopes
There are three types of regular polytopes which exist in every dimension d: regular simplices, (hyper-) cubes, and regular cross-polytopes. In this paper we investigate two pairs of inner and outer j-radii (rj, Rj) and (r̄j, R̄j) of these polytopes (inner and outer radii classes are almost always considered in pairs, such that for a 0-symmetric body K and its dual K the inner (outer) radii of K ...
متن کاملLarge simplices determined by finite point sets
Given a set P of n points in R, let d1 > d2 > . . . denote all distinct inter-point distances generated by point pairs in P . It was shown by Schur, Martini, Perles, and Kupitz that there is at most one d-dimensional regular simplex of edge length d1 whose every vertex belongs to P . We extend this result by showing that for any k the number of d-dimensional regular simplices of edge length dk ...
متن کاملRegular Polytopes in Z
In [3], all embeddings of regular polyhedra in the three dimensional integer lattice were characterized. Here, we prove some results toward solving this problem for all higher dimensions. Similarly to [3], we consider a few special polytopes in dimension 4 that do not have analogues in higher dimensions. We then begin a classification of hypercubes, and consequently regular cross polytopes in t...
متن کاملA New Parallel Matrix Multiplication Method Adapted on Fibonacci Hypercube Structure
The objective of this study was to develop a new optimal parallel algorithm for matrix multiplication which could run on a Fibonacci Hypercube structure. Most of the popular algorithms for parallel matrix multiplication can not run on Fibonacci Hypercube structure, therefore giving a method that can be run on all structures especially Fibonacci Hypercube structure is necessary for parallel matr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Periodica Mathematica Hungarica
دوره 58 شماره
صفحات -
تاریخ انتشار 2009